Effective Bounds for P-Recursive Sequences
نویسندگان
چکیده
We describe an algorithm that takes as input a complex sequence (un) given by a linear recurrence relation with polynomial coe cients along with initial values, and outputs a simple explicit upper bound (vn) such that |un| ≤ vn for all n. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of un. We discuss applications to the evaluation of power series with guaranteed precision.
منابع مشابه
AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملExponential Bounds and Tails for Additive Random Recursive Sequences
Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some clas...
متن کاملExponential Tail Bounds for Max-recursive Sequences
Exponential tail bounds are derived for solutions of max-recursive equations and for maxrecursive random sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise in the worst case analysis of divide and conquer algorithms, in parallel search algorithms or in the height of random tree models. For the proof we de...
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملDefinite Sums of Hypergeometric Terms and Limits of P-Recursive Sequences
The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. This class is defined in terms of linear differential and difference equations with polynomial coefficients. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the reduction-based creative telescoping algorithms to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 45 شماره
صفحات -
تاریخ انتشار 2010